Note on RIP-based Co-sparse Analysis

نویسنده

  • LianLin Li
چکیده

Abstract: Over the past years, there are increasing interests in recovering the signals from undersampling data where such signals are sparse under some orthogonal dictionary or tight framework, which is referred to be sparse synthetic model. More recently, its counterpart, i.e., the sparse analysis model, has also attracted researcher’s attentions where many practical signals which are sparse in the truly redundant dictionary are concerned. This short paper presents important complement to the results in existing literatures for treating sparse analysis model. Firstly, we give the natural generalization of well-known restricted isometry property (RIP) to deal with sparse analysis model, where the truly arbitrary incoherent dictionary is considered. Secondly, we studied the theoretical guarantee for the accurate recovery of signal which is sparse in general redundant dictionaries through solving l1-norm sparsity-promoted optimization problem. This work shows not only that compressed sensing is viable in the context of sparse analysis, but also that accurate recovery is possible via solving l1-minimization problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A remark on weaken restricted isometry property in compressed sensing

The restricted isometry property (RIP) has become well-known in the compressed sensing community. Recently, a weaken version of RIP was proposed for exact sparse recovery under weak moment assumptions. In this note, we prove that the weaken RIP is also sufficient for stable and robust sparse recovery by linking it with a recently introduced robust width property in compressed sensing. Moreover,...

متن کامل

Block-sparse Solutions using Kernel Block RIP and its Application to Group Lasso

We propose kernel block restricted isometry property (KB-RIP) as a generalization of the well-studied RIP and prove a variety of results. First, we present a “sumof-norms”-minimization based formulation of the sparse recovery problem and prove that under suitable conditions on KB-RIP, it recovers the optimal sparse solution exactly. The Group Lasso formulation, widely used as a good heuristic, ...

متن کامل

Traffic Scene Analysis using Hierarchical Sparse Topical Coding

Analyzing motion patterns in traffic videos can be exploited directly to generate high-level descriptions of the video contents. Such descriptions may further be employed in different traffic applications such as traffic phase detection and abnormal event detection. One of the most recent and successful unsupervised methods for complex traffic scene analysis is based on topic models. In this pa...

متن کامل

Homework 2 Foundations of Algorithms for Massive Datasets ( 236779 ) Fall 2015

Small coherence (or, incoherence) has nice properties as we shall see now. Assume A has coherence μ < 1. Prove that for all s < 1/μ, A has RIP with parameters s, δ = sμ. Hint: For s-sparse x, write down ‖Ax‖ = (Ax)Ax using inner products of columns of A. Note: There exist deterministic constructions of k×d matrices with incoherence ∼ 1/ √ k, which by the above imply RIP with parameters s = √ k,...

متن کامل

A Note on Sparsification by Frames

This note proposes a proof of a sharp generalized Dictionary-Restricted Isometry Property (D-RIP) sparsity bound constant for compressed sensing. For fulfilling D-RIP, the constant δk is used in the definition: (1− δk)‖Dv‖2 ≤ ‖ΦDv‖2 ≤ (1+ δk)‖Dv‖. Since a sharp bound for δk has been proved for RIP with δ2k < √ 2 2 by Cai and Zhang, we prove the same sharp bound for D-RIP. This idea can also be ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1202.2037  شماره 

صفحات  -

تاریخ انتشار 2012